Cospectral constructions for several graph matrices using cousin vertices

Abstract Graphs can be associated with a matrix according to some rule and we find the spectrum of graph respect that matrix. Two graphs are cospectral if they have same spectrum. Constructions help us establish patterns about structural information not preserved by We generalize construction for previously given distance Laplacian larger family graphs. In addition, show appropriate assumptions this generalized extends adjacency matrix, combinatorial signless normalized conclude enumerating prevelance in small